An algebraic proof of the Erdős-Ko-Rado theorem for intersecting families of perfect matchings
نویسندگان
چکیده
In this paper we give a proof that the largest set of perfect matchings, in which any two contain a common edge, is the set of all perfect matchings that contain a fixed edge. This is a version of the famous Erdős-Ko-Rado theorem for perfect matchings. The proof given in this paper is algebraic, we first determine the least eigenvalue of the perfect matching derangement graph and use properties of the perfect matching polytope. We also prove that the perfect matching derangement graph is not a Cayley graph.
منابع مشابه
Note Erdős–Ko–Rado from intersecting shadows
A set system is called t-intersecting if every two members meet each other in at least t elements. Katona determined the minimum ratio of the shadow and the size of such families and showed that the Erdős– Ko–Rado theorem immediately follows from this result. The aim of this note is to reproduce the proof to obtain a slight improvement in the Kneser graph. We also give a brief overview of corre...
متن کاملTowards a Katona Type Proof for the 2-intersecting Erdos-Ko-Rado Theorem
We study the possibility of the existence of a Katona type proof for the Erdős-Ko-Rado theorem for 2and 3-intersecting families of sets. An Erdős-Ko-Rado type theorem for 2-intersecting integer arithmetic progressions and a model theoretic argument show that such an approach works in the 2-intersecting case.
متن کاملTHE EIGENVALUE METHOD FOR CROSS t-INTERSECTING FAMILIES
We show that the Erdős–Ko–Rado inequality for t-intersecting families of subsets can be easily extended to an inequality for cross t-intersecting families by using the eigenvalue method. The same applies to the case of t-intersecting families of subspaces. The eigenvalue method is one of the proof techniques to get Erdős–Ko–Rado type inequalities for t-intersecting families, for example, a proo...
متن کاملAhlswede–Khachatrian theorem
The Erdős–Ko–Rado theorem determines the largest μp-measure of an intersecting family of sets. We consider the analogue of this theorem to t-intersecting families (families in which any two sets have at least t elements in common), following Ahlswede and Khachatrian [1, 2]. We present a proof of the μp version of their theorem, which is adapted from the earlier proofs. Due to the simpler nature...
متن کاملAn Erd\H{o}s--Ko--Rado theorem for matchings in the complete graph
We consider the following higher-order analog of the Erdős–Ko–Rado theorem. For positive integers r and n with r ≤ n, let Mn be the family of all matchings of size r in the complete graph K2n. For any edge e ∈ E(K2n), the family Mn(e), which consists of all sets in Mn containing e is called the star centered at e. We prove that if r < n and A ⊆ Mn is an intersecting family of matchings, then |A...
متن کامل